Hybridizing Integer Programming and Metaheuristics for Solving High School Timetabling
نویسندگان
چکیده
منابع مشابه
Solving Timetabling Problems by Hybridizing Genetic Algorithms and Tabu Search
As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general s...
متن کاملAn Integer Programming Model for the School Timetabling Problem
This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...
متن کاملA genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملHybridizing Integer Programming Models with an Adaptive Decomposition Approach for Exam Timetabling Problems
The idea of decomposition has been successfully applied to address large combinatorial optimization problems across a range of applications. However, in timetabling, it has not been widely applied. One major difficulty of course, is that early assignment in one sub-problem may lead to later conflict in solving interrelated sub-problems. In our previous work, timetabling problems were adaptively...
متن کاملA Unified View on Hybrid Metaheuristics
Manifold possibilities of hybridizing individual metaheuristics with each other and/or with algorithms from other fields exist. A large number of publications documents the benefits and great success of such hybrids. This article overviews several popular hybridization approaches and classifies them based on various characteristics. In particular with respect to low-level hybrids of different m...
متن کامل